A wide range no-regret theorem

نویسنده

  • Ehud Lehrer
چکیده

In a sequential decision problem at any stage a decision maker, based on the history, takes a decision and receives a payoff which depends also on the realized state of nature. A strategy, f , is said to be as good as an alternative strategy g at a sequence of states, if in the long run f does, on average, at least as well as g does. It is shown that for any distribution, μ, over the alternative strategies there is a strategy f which is, at any sequence of states, as good as μ-almost any alternative g. 1I am grateful to Ehud Kalai, Rann Smorodinsky and Eilon Solan for fruitful discussions on this subject. I am also grateful to two anonymous referees of Games and Economic Behavior. This research was partially supported by the Israel Science Foundation, Grant no. 178/9910.0.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Wide Range Regret with Time Selection Functions

We consider the problem of minimizing regret with respect to a given set S of pairs of time selection functions and modifications rules. We give an online algorithm that has O( √ T log |S|) regret with respect to S when the algorithm is run for T time steps and there are N actions allowed. This improves the upper bound of O( √ TN log(|I||F|)) given by Blum and Mansour [BM07a] for the case when ...

متن کامل

No Regret and the Minimax Theorem of Game

i=1 pi log 1 pi . To do this, we must bound the two terms on the right hand side of the bound above. Step 1: Bounding the Range of the Regularizer We begin by deriving upper and lower bounds on the entropy function H(~ p). The lower bound is easy. Since for all i, 0 ≤ pi ≤ 1 , pi log 1 p i ≥ 0. (Remember that we define 0 log(1/0) to be 0 by convention.) As we discussed before, H(~ p) = 0 is ach...

متن کامل

A novel existence and uniqueness theorem for solutions to FDEs driven by Lius process with weak Lipschitz coefficients

This paper we investigate the existence and uniqueness of solutions to fuzzydierential equations driven by Liu's process. For this, it is necessary to provideand prove a new existence and uniqueness theorem for fuzzy dierential equationsunder weak Lipschitz condition. Then the results allows us to considerand analyze solutions to a wide range of nonlinear fuzzy dierential equationsdriven by Liu...

متن کامل

Calibration and Internal no-Regret with Partial Monitoring

Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of Blackwell's approachability theorem , in an other auxiliary game. We establish the converse: a strategy that approaches a convex B-set can be derived from the construction of a calibrated strategy. We develop these tool...

متن کامل

No-Φ-Regret: A Connection between Computational Learning Theory and Game Theory

This paper explores a fundamental connection between computational learning theory and game theory through a property we call no-Φ-regret. Given a set of transformations Φ (i.e., mappings from actions to actions), a learning algorithm is said to exhibit no Φ-regret if an agent experiences no regret for playing the actions the algorithm prescribes, rather than playing the transformed actions pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2003